Zone design of specific sizes using adaptive additively weighted Voronoi diagrams

نویسندگان

  • Pilar Moreno-Regidor
  • Jésus García López de Lacalle
  • Miguel-Ángel Manso-Callejo
چکیده

Territory or zone design processes entail partitioning a geographic space, organized as a set of areal units, into different regions or zones according to a specific set of criteria that are dependent on the application context. In most cases, the aim is to create zones of approximately equal sizes (zones with equal numbers of inhabitants, same average sales, etc.). However, some of the new applications that have emerged, particularly in the context of sustainable development policies, are aimed at defining zones of a predetermined, though not necessarily similar, size. In addition, the zones should be built around a given set of seeds. This type of partitioning has not been sufficiently researched; therefore, there are no known approaches for automated zone delimitation. This study proposes a new method based on a discrete version of the adaptive additively weighted Voronoi diagram that makes it possible to partition a two-dimensional space into zones of specific sizes, taking both the position and the weight of each seed into account. The method consists of repeatedly solving a traditional additively weighted Voronoi diagram, so that each seed's weight is updated at every iteration. The zones are geographically connected using a metric based on the shortest path. Tests conducted on the extensive farming system of three municipalities in Castile-La Mancha (Spain) have established that the proposed heuristic procedure is valid for solving this type of partitioning problem. Nevertheless, these tests confirmed that the given seed position determines the spatial configuration the method must solve and this may have a great impact on the resulting partition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries

The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a precomputation approach to OSR query in vector spaces. We exploit the geometric properties of the solution space and theoretically prove it...

متن کامل

Convex Hull and Voronoi Diagram of Additively Weighted Points

We provide a complete description of dynamic algorithms for constructing convex hulls and Voronoi diagrams of additively weighted points of R. We present simple algorithms and provide a complete description of all the predicates. The algorithms have been implemented in R and experimental results are reported. Our implementation follows the CGAL design and, in particular, is made both robust and...

متن کامل

Additively Weighted Voronoi Diagram on the Oriented Projective Plane Additively Weighted Voronoi Diagram on the Oriented Projective Plane

We consider Voronoi diagrams deened on the oriented projective plane T 2. In this geometry, the closest and furthest site diagrams are antipodal. We give a simple on-line incremental algorithm for constructing the additively weighted diagram. This diagram, which may be disconnected in Euclidean plane, is always connected in T 2 and has exactly 3n ? 6 edges and 2n ? 4 vertices, where n is the nu...

متن کامل

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time

We present an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant number of faces. We show how to preprocess G in Õ(nb) time so that one can compute any additively weighted Voronoi diagram for these sites in Õ(b) time. We use this construction to compute the diameter of a directe...

متن کامل

Additively Weighted Voronoi Diagram on the Oriented Projective Plane

We give a new simple on-line incremental algorithm for the additively weighted Voronoi diagram, whose primitive operations are completely based on orientation tests. It is known that the closest site diagram can be disconnected, and that the furthest site diagram can have disconnected faces. The algorithm avoids such nuisances by using the oriented projective plane as an underlying geometry. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Geographical Information Science

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2012